Steiner minimal trees, twist angles, and the protein folding problem.
نویسندگان
چکیده
The Steiner Minimal Tree (SMT) problem determines the minimal length network for connecting a given set of vertices in three-dimensional space. SMTs have been shown to be useful in the geometric modeling and characterization of proteins. Even though the SMT problem is an NP-Hard Optimization problem, one can define planes within the amino acids that have a surprising regularity property for the twist angles of the planes. This angular property is quantified for all amino acids through the Steiner tree topology structure. The twist angle properties and other associated geometric properties unique for the remaining amino acids are documented in this paper. We also examine the relationship between the Steiner ratio rho and the torsion energy in amino acids with respect to the side chain torsion angle chi(1). The rho value is shown to be inversely proportional to the torsion energy. Hence, it should be a useful approximation to the potential energy function. Finally, the Steiner ratio is used to evaluate folded and misfolded protein structures. We examine all the native proteins and their decoys at http://dd.stanford.edu. and compare their Steiner ratio values. Because these decoy structures have been delicately misfolded, they look even more favorable than the native proteins from the potential energy viewpoint. However, the rho value of a decoy folded protein is shown to be much closer to the average value of an empirical Steiner ratio for each residue involved than that of the corresponding native one, so that we recognize the native folded structure more easily. The inverse relationship between the Steiner ratio and the energy level in the protein is shown to be a significant measure to distinguish native and decoy structures. These properties should be ultimately useful in the ab initio protein folding prediction.
منابع مشابه
On the configuration space of Steiner minimal trees
Among other results, we prove the following theorem about Steiner minimal trees in ddimensional Euclidean space: if two finite sets in R have unique and combinatorially equivalent Steiner minimal trees, then there is a homotopy between the two sets that maintains the uniqueness and the combinatorial structure of the Steiner minimal tree throughout the homotopy.
متن کاملLocally minimal uniformly oriented shortest networks
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalisation of the classical Euclidean and rectilinear Steiner ...
متن کاملFull Minimal Steiner Trees on Lattice Sets
Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it often proves far more tractable if we restrict our attention to points in special geometric configur...
متن کاملGromov Minimal Fillings for Finite Metric Spaces
The problem discussed in this paper was stated by Alexander O. Ivanov and Alexey A. Tuzhilin in 2009. It stands at the intersection of the theories of Gromov minimal fillings and Steiner minimal trees. Thus, it can be considered as one-dimensional stratified version of the Gromov minimal fillings problem. Here we state the problem; discuss various properties of one-dimensional minimal fillings,...
متن کاملA Stochastic Optimization Algorithm for Steiner Minimal Trees
The Optimization problem is simply stated as follows: Given a set of N cities, construct a connected network which has minimum length. The problem is simple enough, but the catch is that you are allowed to add junctions in your network. Therefore the problem becomes how many extra junctions should be added, and where should they be placed so as to minimize the overall network length. This intri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proteins
دوره 66 4 شماره
صفحات -
تاریخ انتشار 2007